On the geodetic hull number of P-free graphs
نویسندگان
چکیده
منابع مشابه
The Geodetic Hull Number is Hard for Chordal Graphs
We show the hardness of the geodetic hull number for chordal graphs.
متن کاملOn the Hull Number of Triangle-Free Graphs
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest convex set containing S. The hull number h(G) of a graph G is the smallest cardinality of a set of vertices whose convex hull is the vertex set of G. For a connected triangle-free graph G of order n and diameter d ≥ 3, we ...
متن کاملOn the geodetic number of median graphs
A set of vertices S in a graph is called geodetic if every vertex of this graph lies on some shortest path between two vertices from S. In this paper, minimum geodetic sets in median graphs are studied with respect to the operation of peripheral expansion. Along the way geodetic sets of median prisms are considered and median graphs that possess a geodetic set of size two are characterized. © 2...
متن کاملOn the Steiner, geodetic and hull numbers of graphs
Given a graph G and a subset W ⊆ V (G), a Steiner W -tree is a tree of minimum order that contains all of W . Let S(W ) denote the set of all vertices in G that lie on some Steiner W -tree; we call S(W ) the Steiner interval of W . If S(W ) = V (G), then we call W a Steiner set of G. The minimum order of a Steiner set of G is called the Steiner number of G. Given two vertices u, v in G, a short...
متن کاملThe geodetic number of strong product graphs
For two vertices u and v of a connected graph G, the set IG[u, v] consists of all those vertices lying on u − v geodesics in G. Given a set S of vertices of G, the union of all sets IG[u, v] for u, v ∈ S is denoted by IG[S]. A set S ⊆ V (G) is a geodetic set if IG[S] = V (G) and the minimum cardinality of a geodetic set is its geodetic number g(G) of G. Bounds for the geodetic number of strong ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.05.047